Primal-Dual Algorithms for Deterministic Inventory Problems

Primal - Dual Algorithms for Combinatorial Optimization Problems

Title of dissertation: PRIMAL-DUAL ALGORITHMS FOR COMBINATORIAL OPTIMIZATION PROBLEMS Julián Mestre Doctor of Philosophy, 2007 Dissertation directed by: Professor Samir Khuller Department of Computer Science Combinatorial optimization problems such as routing, scheduling, covering and packing problems abound in everyday life. At a very high level, a combinatorial optimization problem amounts to...

Primal-dual path-following algorithms for circular programming

Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...

Fuzzy Primal Simplex Algorithms for Solving Fuzzy Linear Programming Problems

Primal-Dual Algorithms for Connected Facility Location Problems

New primal-dual algorithms for Steiner tree problems

We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree problem (DST), and the set cover problem (SC) which is a subcase of DST. All our problems are NP-hard; so we are interested in approximation algorithms for them. First we give an algorithm for DST which is based on the tradi...